Participating in the Berlin Workshop

26. Workshop uber Komplexitätstheorie, Datenstrukturen und effiziente Algorithmen, TU-Berlin

Can easy sets only have easy certificate schemes? In this paper, we study the class ofsets that, for all NP certificate schemes (i.e., NP machines), always have easy acceptancecertificates (i.e., accepting paths that can be computed in polynomial time). We alsostudy the class of sets that, for all NP certificate schemes, infinitely often have easyacceptance certificates. We give...

WLP 2000, 15th Workshop on Logic Programming and Constraint Systems, Collocated ECAI 2000 Workshop, Berlin, August 25-27, 2000

Melting Pots: Berlin Digital meets Berlin Culture

Forming, storming, norming and performing [1] – a well-known phase-modulation model of team building is probably reliable to describe the changeful relationship of Berlin Cultural and Berlin Digital in the Melting Pot of the metropolis. The pretty, shy bride awkwardly meets a nerdy, hyperactive groom when after the fall of the Berlin wall on November 9th, 1989, the wedding looms on the horizon:...

the u.s. policy in central asia and its impact on the colored revolutions in the region (the case study of tulip revolution in kyrgyzstan)

چکیده ندارد.

The Berlin SPARQL Benchmark

The SPARQL Query Language for RDF and the SPARQL Protocol for RDF are implemented by a growing number of storage systems and are used within enterprise and open Web settings. As SPARQL is taken up by the community, there is a growing need for benchmarks to compare the performance of storage systems that expose SPARQL endpoints via the SPARQL protocol. Such systems include native RDF stores as w...